Robust Clustering Based on Global Data Distribution and Local Connectivity Matrix
نویسندگان
چکیده
A new method to clustering analysis, which is based on integration of graph theoretical method and fuzzy objective fimction algorithm, is developed. The connectivity mritriv derived from fuzzy limited neighborhood graph and the measurement for similarity and dissimilarity a re utilized to build a new fuzzy objective function that iinifles global data distribution and local spatial information. In some sense, both the traditional graph theoretical method and objective function algorithm are special cases of our algorithm.
منابع مشابه
Identification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data
Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...
متن کاملClassification of Right/Left Hand Motor Imagery by Effective Connectivity Based on Transfer Entropy in EEG Signal
The right and left hand Motor Imagery (MI) analysis based on the electroencephalogram (EEG) signal can directly link the central nervous system to a computer or a device. This study aims to identify a set of robust and nonlinear effective brain connectivity features quantified by transfer entropy (TE) to characterize the relationship between brain regions from EEG signals and create a hierarchi...
متن کاملRobust Agent Based Distribution System Restoration with Uncertainty in Loads in Smart Grids
This paper presents a comprehensive robust distributed intelligent control for optimum self-healing activities in smart distribution systems considering the uncertainty in loads. The presented agent based framework obviates the requirements for a central control method and improves the reliability of the self-healing mechanism. Agents possess three characteristics including local views, decentr...
متن کاملModified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کامل